Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
(x * y) * z |
→ x * (y * z) |
| 2: |
|
(x + y) * z |
→ (x * z) + (y * z) |
| 3: |
|
x * (y + f(z)) |
→ g(x,z) * (y + y) |
|
There are 5 dependency pairs:
|
| 4: |
|
(x * y) *# z |
→ x *# (y * z) |
| 5: |
|
(x * y) *# z |
→ y *# z |
| 6: |
|
(x + y) *# z |
→ x *# z |
| 7: |
|
(x + y) *# z |
→ y *# z |
| 8: |
|
x *# (y + f(z)) |
→ g(x,z) *# (y + y) |
|
The approximated dependency graph contains 2 SCCs:
{8}
and {4-7}.
-
Consider the SCC {8}.
There are no usable rules.
The constraints could not be solved.
-
Consider the SCC {4-7}.
The constraints could not be solved.
Tyrolean Termination Tool (0.03 seconds)
--- May 4, 2006